Halftoning with Noncrossing Line Segments
نویسندگان
چکیده
منابع مشابه
A Long Noncrossing Path Among Disjoint Segments in the Plane
Let L be a collection of n pairwise disjoint segments in general position in the plane. We show that one can find a subcollection of Ω(n1/3) segments that can be completed to a noncrossing simple path by adding rectilinear edges between endpoints of pairs of segments. On the other hand, there is a set L of n segments for which no subset of size (2n)1/2 or more can be completed to such a path.
متن کاملFinding Line Segments with Tabu Search
The problem of detecting straight lines arises frequently in image processing and computer vision. Here we consider the problem of extracting lines from range images and more generally from sets of three-dimensional (3D) points. The problem is stated as follows. Given a set Γ of points in 3D space and a non-negative constant , determine the line that is at a distance at most from the maximal nu...
متن کاملTracking Line Segments
This paper describes the development and the implementation of a line segments based token tracker. Given a sequence of time-varying images, the goal is to track line segments corresponding to the edges extracted from the image being analyzed. We will present a tracking approach that combines a prediction and a matching steps. The prediction step is a Kalman filtering based approach that is use...
متن کاملDigitalizing line segments
We introduce a novel and general approach for digitalization of line segments in the plane that satisfies a set of axioms naturally arising from Euclidean axioms. In particular, we show how to derive such a system of digital segments from any total order on the integers. As a consequence, using a well-chosen total order, we manage to define a system of digital segments such that all digital seg...
متن کاملOn Indexing Line Segments
In several image applications, it is necessary to retrieve specific line segments born a potentially very large set. In this paper, we consider the problem of indexing straight line segments to enable efficient retrieval of all line segments that (i) go through a specified point, or (ii) intersect a specified line segment. We propose a data organization, based on the Hough transform, that can b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of The Institute of Image Information and Television Engineers
سال: 2010
ISSN: 1881-6908,1342-6907
DOI: 10.3169/itej.64.1379